Step of Proof: fincr_wf2
12,41
postcript
pdf
Inference at
*
1
4
2
I
of proof for Lemma
fincr
wf2
:
1.
i
:
2.
f
: {
f
|
i
:{
z
:
|
z
<
i
}
if (
i
=
0) then
else {
f
(
i
- 1)...} fi }
3.
j
:{
k
:
|
k
<
i
} .
f
(
j
)
if (
i
=
0) then
else {
f
(
i
- 1)...} fi
Type
latex
by ((SplitITE 0)
CollapseTHEN (Try (((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term))
CollapseTHEN (Fail))
))
latex
C
1
: .....falsecase..... NILNIL
C1:
4.
i
0
C1:
{
f
(
i
- 1)...}
Type
C
.
Definitions
ff
,
tt
,
t
T
,
if
b
then
t
else
f
fi
,
P
Q
,
P
Q
,
x
:
A
.
B
(
x
)
,
Lemmas
eq
int
eq
false
elim
sqequal
,
eq
int
eq
true
elim
sqequal
,
bool
cases
sqequal
,
eq
int
wf
origin